Toughness and spanning trees in K4‐minor‐free graphs
نویسندگان
چکیده
منابع مشابه
Toughness and spanning trees in K4mf graphs
A k-tree is a tree with maximum degree at most k, and a k-walk is a closed walk with each vertex repeated at most k times. A k-walk can be obtained from a k-tree by visiting each edge of the k-tree twice. Jackson and Wormald conjectured in 1990 that for k ≥ 2, every 1 k−1 -tough connected graph contains a spanning k-walk. This conjecture is open even for planar graphs. We confirm this conjectur...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملSpanning Trees In Dense Graphs
1.1. Notation and definitions We will sometimes use + and Σ to denote disjoint unions of sets. V (G) and E(G) denote the vertex set and the edge set of the graph G, and we write v(G) = |V (G)| (order of G) and e(G) = |E(G)| (size of G). (A,B) or (A,B, E) denote a bipartite graph G = (V , E), where V = A+B, and E ⊂ A×B. In general, given any graph G and two disjoint subsets A,B of V (G), the pai...
متن کاملSpanning Trees in Grid Graphs
X iv :0 80 9. 25 51 v1 [ m at h. C O ] 1 5 Se p 20 08 Spanning Trees in Grid Graphs Paul Raff July 25, 2008 Abstract A general method is obtained for finding recurrences involving the number of spanning trees of grid graphs, obtained by taking the graph product of an arbitrary graph and path or cycle. The results in this paper extend the work by Desjarlais and Molina and give concrete methods f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2020
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22620